Constrained Geodesic Centers of a Simple Polygon
نویسندگان
چکیده
For any two points in a simple polygon P , the geodesic distance between them is the length of the shortest path contained in P that connects them. A geodesic center of a set S of sites (points) with respect to P is a point in P that minimizes the geodesic distance to its farthest site. In many realistic facility location problems, however, the facilities are constrained to lie in feasible regions. In this paper, we show how to compute the geodesic centers constrained to a set of line segments or simple polygonal regions contained in P . Our results provide substantial improvements over previous algorithms. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
منابع مشابه
Computing the Constrained Euclidean, Geodesic and Link Centre of a Simple Polygon with Applications
In the manufacturing industry, nding a suitable location for the pin gate (the pin gate is the point from which liquid is poured or injected into a mold) is a diicult problem when viewed from the uid dynamics of the molding process. However, experience has shown that a suitable pin gate location possesses several geometric characteristics, namely the distance from the pin gate to any point in t...
متن کاملCovering the Boundary of a Simple Polygon with Geodesic Unit Disks
We present an O(n log n) time 2-approximation algorithm for computing the number of geodesic unit disks needed to cover the boundary of a simple polygon on n vertices. The running time thus only depends on the number of vertices and not on the number of disks; the disk centers can be computed in additional time proportional to the number of disks.
متن کاملSpeed-constrained geodesic fréchet distance inside a simple polygon
Given two polygonal curves inside a simple polygon, we study the problem of finding the Fréchet distance between the two curves under the following two conditions (i) the distance between two points on the curves is measured as the length of the shortest path between them lying inside the simple polygon, and (ii) the traversal along each segment of the polygonal curves is restricted to be betwe...
متن کاملComputing the Geodesic Center of a Simple Polygon
The geodesic center of a simple polygon is a point inside the polygon which minimizes the maximum internal distance to any point in the polygon. We present an algorithm which calculates the geodesic center of a simple polygon with n vertices in time O(n log n).
متن کاملThe Geodesic Farthest-point Voronoi Diagram in a Simple Polygon
Given a set of point sites in a simple polygon, the geodesic farthest-point Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O(n log log n+m logm)time algorithm to compute the geodesic farthest-point Voronoi diagram of m point sites in a simple n-gon. This i...
متن کامل